Ant Colony Optimization for Capacity Problems
نویسنده
چکیده
This paper deals with the optimization of the capacity of a terminal railway station using the Ant Colony Optimization algorithm. The capacity of the terminal station is defined as the number of trains that depart from the station in unit interval of time. The railway capacity optimization problem is framed as a typical symmetrical Travelling Salesman Problem (TSP), with the TSP nodes representing the train arrival /departure events and the TSP total cost representing the total time-interval of the schedule. The application problem is then optimized using the ACO algorithm. The simulation experiments validate the formulation of the railway capacity problem as a TSP and the ACO algorithm produces optimal solutions superior to those produced by the domain experts.
منابع مشابه
New Ant Colony Algorithm Method based on Mutation for FPGA Placement Problem
Many real world problems can be modelled as an optimization problem. Evolutionary algorithms are used to solve these problems. Ant colony algorithm is a class of evolutionary algorithms that have been inspired of some specific ants looking for food in the nature. These ants leave trail pheromone on the ground to mark good ways that can be followed by other members of the group. Ant colony optim...
متن کاملA systematic approach for estimation of reservoir rock properties using Ant Colony Optimization
Optimization of reservoir parameters is an important issue in petroleum exploration and production. The Ant Colony Optimization(ACO) is a recent approach to solve discrete and continuous optimization problems. In this paper, the Ant Colony Optimization is usedas an intelligent tool to estimate reservoir rock properties. The methodology is illustrated by using a case study on shear wave velocity...
متن کاملGradient-based Ant Colony Optimization for Continuous Spaces
A novel version of Ant Colony Optimization (ACO) algorithms for solving continuous space problems is presented in this paper. The basic structure and concepts of the originally reported ACO are preserved and adaptation of the algorithm to the case of continuous space is implemented within the general framework. The stigmergic communication is simulated through considering certain direction vect...
متن کاملGradient-based Ant Colony Optimization for Continuous Spaces
A novel version of Ant Colony Optimization (ACO) algorithms for solving continuous space problems is presented in this paper. The basic structure and concepts of the originally reported ACO are preserved and adaptation of the algorithm to the case of continuous space is implemented within the general framework. The stigmergic communication is simulated through considering certain direction vect...
متن کاملFORCED WATER MAIN DESIGN MIXED ANT COLONY OPTIMIZATION
Most real world engineering design problems, such as cross-country water mains, include combinations of continuous, discrete, and binary value decision variables. Very often, the binary decision variables associate with the presence and/or absence of some nominated alternatives or project’s components. This study extends an existing continuous Ant Colony Optimization (ACO) algorithm to simultan...
متن کاملAn Ant Colony approach to forward-reverse logistics network design under demand certainty
Forward-reverse logistics network has remained a subject of intensive research over the past few years. It is of significant importance to be issued in a supply chain because it affects responsiveness of supply chains. In real world, problems are needed to be formulated. These problems usually involve objectives such as cost, quality, and customers' responsiveness and so on. To this reason, we ...
متن کامل